Size-constrained graph partitioning polytopes

Size - constrained graph partitioning polytope

We consider the problem of clustering a set of items into subsets whose sizes are bounded from above and below. We formulate the problem as a graph partitioning problem and propose an integer programming model for solving it. This formulation generalizes several well-known graph partitioning problems from the literature like the clique partitioning problem, the equi-partition problem and the k-...

متن کامل

Size-constrained graph partitioning polytope. Part II: Non-trivial facets

We consider the problem of clustering a set of items into subsets whose sizes are bounded from above and below. We formulate the problem as a graph partitioning problem and propose an integer programming model for solving it. This formulation generalizes several well-known graph partitioning problems from the literature like the clique partitioning problem, the equi-partition problem and the k-...

متن کامل

Partitioning Complex Networks via Size-Constrained Clustering

The most commonly used method to tackle the graph partitioning problem in practice is the multilevel approach. During a coarsening phase, a multilevel graph partitioning algorithm reduces the graph size by iteratively contracting nodes and edges until the graph is small enough to be partitioned by some other algorithm. A partition of the input graph is then constructed by successively transferr...

متن کامل

Size-constrained graph partitioning polytope. Part I: Dimension and trivial facets

We consider the problem of clustering a set of items into subsets whose sizes are bounded from above and below. We formulate the problem as a graph partitioning problem and propose an integer programming model for solving it. This formulation generalizes several well-known graph partitioning problems from the literature like the clique partitioning problem, the equi-partition problem and the k-...

متن کامل

Cardinality Constrained Graph Partitioning into Cliques with Submodular Costs

We consider the problem of partitioning a graph into cliques of bounded cardinality. The goal is to find a partition that minimizes the sum of clique costs where the cost of a clique is given by a set function on the nodes. We present a general algorithmic solution based on solving the problem variant without the cardinality constraint. We yield constant factor approximations depending on the s...

متن کامل

Size-constrained graph partitioning polytopes

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

منابع مشابه